package com.lzh.recursion;

/**
 * @author liuzhihao
 * @create 2022-01-03 1:35
 *
 * 迷宫问题： 求最短路径
 */
public class MiGongPath {

    public static void main(String[] args) {

        int[][] map = new int[8][7];

        for (int i=0;i < 8; i++) {
            map[i][0] = 1;
            map[i][6] = 1;
        }

        for (int i = 0;i< 7; i++) {
            map[0][i] = 1;
            map[7][i] = 1;
        }

        map[3][1] = 1;
        map[4][2] = 1;

        System.out.println("地图：");
        for (int i = 0; i < 8; i++) {
            for (int j = 0; j < 7; j++) {
                System.out.print(map[i][j] + " ");
            }
            System.out.println();

        }
        System.out.println();

        searchWay(map, 1, 1);
        System.out.println("查找路线地图：");
        for (int i = 0; i < 8; i++) {
            for (int j = 0; j < 7; j++) {
                System.out.print(map[i][j] + " ");
            }
            System.out.println();

        }
        System.out.println();
    }

    public static boolean searchWay(int[][] map, int i, int j) {
        if (map[6][5] == 2) {
            return true;
        } else {
           if (map[i][j] == 0) {
               map[i][j] = 2;
               if (searchWay(map, i+1, j)) {
                   return true;
               } else if (searchWay(map, i, j+1)){
                   return true;
               } else if(searchWay(map, i - 1,j)) {
                   return true;
               } else if(searchWay(map, i, j - 1)) {
                   return true;
               } else {
                   map[i][j] = 3;
                   return false;
               }
           } else {
               return false;
           }
        }
    }

}
